A Factorization of the Conway Polynomial
نویسنده
چکیده
It is tempting to conjecture that there is some interesting relationship between the Conway polynomial ∇L(z) of a link L and ∇K(z), where K is a knot obtained by banding together the components of L. Obviously they cannot be equal since only terms of even or odd degree appear in ∇L(z), according to whether L has an odd or even number of components. Moreover there are many ways of choosing bands and one can easily see that the variety of knots one obtains can have very different polynomials. Nevertheless we will demonstrate that ∇L(z) and ∇K(z) have a very precise relationship in the form of a factorization: ∇L(z) = ∇K(z)Γ(z)
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملTHE USE OF SEMI INHERITED LU FACTORIZATION OF MATRICES IN INTERPOLATION OF DATA
The polynomial interpolation in one dimensional space R is an important method to approximate the functions. The Lagrange and Newton methods are two well known types of interpolations. In this work, we describe the semi inherited interpolation for approximating the values of a function. In this case, the interpolation matrix has the semi inherited LU factorization.
متن کاملRiordan group approaches in matrix factorizations
In this paper, we consider an arbitrary binary polynomial sequence {A_n} and then give a lower triangular matrix representation of this sequence. As main result, we obtain a factorization of the innite generalized Pascal matrix in terms of this new matrix, using a Riordan group approach. Further some interesting results and applications are derived.
متن کاملA Factorization of the Conway Polynomial and Covering Linkage Invariants
J.P. Levine showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the μ̄-invariants of a string link with the link as its closure. We give another description of the latter factor: the determinant of a matrix whose entries are linking pairin...
متن کاملPolyak-viro Formulas for Coefficients of the Conway Polynomial
We describe the Polyak-Viro arrow diagram formulas for the coefficients of the Conway polynomial. As a consequence, we obtain the Conway polynomial as a state sum over some subsets of the crossings of the knot diagram. It turns out to be a simplification of a special case of Jaeger’s state model for the HOMFLY polynomial. Introduction In this paper we are working with the Conway polynomial ∇(L)...
متن کامل